/*
 * 		Author : Xerxes
 * 		Program: 
 * 		Created On : 29.09.2011 08:13:55 BDT
 *      "I have not failed, I have just found 10000 ways that won't work.
 * 
*/


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define tp pair< int, pair<int,int> >
#define mmk( x, y , z ) mk( x, mk( y, z ) )

inline void wait( double seconds ){
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ){
        ;
    }
}
int N;
vector< vector<int> > go;
int cando[ 40 ];
inline int recur(int father){
	vector< int > cango = go[father];
	int sz = SZ(cango);
	if( sz==0 )return 1;
	
	int &total = cando[father];
	if( total!=-1 ){
		return total;
	}
	total=0;
	fo(i,0,sz){
		int child = cango[i];
		total+= recur( child );
	}
return total;
}
inline void doit(){
	SET(cando,-1);
	int var = recur(0);;
	cout<<var<<"\n";
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in","rt",stdin);
    #endif
    string feed="";
    while( scanf("%d",&N)==1 ){
		go.assign(N,vector<int>() );
		int n,x;
			fo(i,0,N){
				CI(n);
					fo(j,0,n){
						CI(x);
						go[i].pb(x);
					}
			}
		cout<<feed;
		doit();
		feed="\n";
	}
	

return 0;
}


